- algorithmic function
- Математика: алгоритмическая функция
Универсальный англо-русский словарь. Академик.ру. 2011.
Универсальный англо-русский словарь. Академик.ру. 2011.
Algorithmic learning theory — (or algorithmic inductive inference) is a framework for machine learning.The framework was introduced in E. Mark Gold s seminal paper Language identification in the limit . The objective of language identification is for a machine running one… … Wikipedia
Algorithmic efficiency — In computer science, efficiency is used to describe properties of an algorithm relating to how much of various types of resources it consumes. Algorithmic efficiency can be thought of as analogous to engineering productivity for a repeating or… … Wikipedia
Function point — A function point is a unit of measurement to express the amount of business functionality an information system provides to a user. Function points are the units of measure used by the IFPUG Functional Size Measurement Method. The IFPUG FSM… … Wikipedia
Dehn function — In the mathematical subject of geometric group theory, a Dehn function, named after Max Dehn, is an optimal function associated to a finite group presentation which bounds the area of a relation in that group (that is a freely reduced word in the … Wikipedia
Double exponential function — A double exponential function (red curve) compared to a single exponential function (blue curve). A double exponential function is a constant raised to the power of an exponential function. The general formula is , which grows much more quickly… … Wikipedia
Euler's totient function — For other functions named after Euler, see List of topics named after Leonhard Euler. The first thousand values of φ(n) In number theory, the totient φ(n) of a positive integer n is defined to be the number of positive integers less than or equal … Wikipedia
Higher-order function — In mathematics and computer science, higher order functions or functionals are functions which do at least one of the following: *take one or more functions as an input *output a function.In mathematics these are also known as operators or… … Wikipedia
Divisor function — σ0(n) up to n = 250 Sigma function σ … Wikipedia
Dedekind zeta function — In mathematics, the Dedekind zeta function of an algebraic number field K, generally denoted ζK(s), is a generalization of the Riemann zeta function which is obtained by specializing to the case where K is the rational numbers Q. In particular,… … Wikipedia
Prime-counting function — In mathematics, the prime counting function is the function counting the number of prime numbers less than or equal to some real number x cite book |first=Eric |last=Bach |coauthors=Shallit, Jeffrey |year=1996 |title=Algorithmic Number Theory… … Wikipedia
Naor-Reingold Pseudorandom Function — In 1997, Moni Naor and Omer Reingold described efficient constructions for various cryptographic primitives in private key as well as public key cryptography. Their result is the construction of an efficient pseudorandom function. Let p and l be… … Wikipedia